Adaptive Neighborhood Graph for LTSA Learning Algorithm without Free-Parameter
نویسندگان
چکیده
Local Tangent Space Alignment (LTSA) algorithm is a classic local nonlinear manifold learning algorithm based on the information about local neighborhood space, i.e., local tangent space with respect to each point in dataset, which aims at finding the low-dimension intrinsic structure lie in high dimensional data space for the purpose of dimensionality reduction. In this paper, we present a novel learning algorithm, called 3N-LTSA which needs no free parameter in contrast to LTSA by using an adaptive nearest neighborhood graph. Experimental results show that 3N-LTSA algorithm without free parameter performs more practical and simple algorithm than LTSA. General Terms Pattern Recognition; Dimensionality Reduction;
منابع مشابه
An Adaptive Neighborhood Graph for LLE Algorithm without Free-Parameter
Locally Linear Embedding (LLE) algorithm is the first classic nonlinear manifold learning algorithm based on the local structure information about the data set, which aims at finding the low-dimension intrinsic structure lie in high dimensional data space for the purpose of dimensionality reduction. One deficiency appeared in this algorithm is that it requires users to give a free parameter k w...
متن کاملThe Time Adaptive Self Organizing Map for Distribution Estimation
The feature map represented by the set of weight vectors of the basic SOM (Self-Organizing Map) provides a good approximation to the input space from which the sample vectors come. But the timedecreasing learning rate and neighborhood function of the basic SOM algorithm reduce its capability to adapt weights for a varied environment. In dealing with non-stationary input distributions and changi...
متن کاملAn Automatic and Adaptive Multi-manifolds Learning Algorithm
Isomap is a classic and representative manifold learning algorithm for nonlinear dimensionality reduction, which aims to circumvent the problem of “the curse of dimensionality” and attempts to recover the intrinsic structure hidden in high-dimensional data based on the assumption that data lie in or near a single manifold. However, Isomap fails to work when data set consists of multi-clusters o...
متن کاملAdaptive Approximation-Based Control for Uncertain Nonlinear Systems With Unknown Dead-Zone Using Minimal Learning Parameter Algorithm
This paper proposes an adaptive approximation-based controller for uncertain strict-feedback nonlinear systems with unknown dead-zone nonlinearity. Dead-zone constraint is represented as a combination of a linear system with a disturbance-like term. This work invokes neural networks (NNs) as a linear-in-parameter approximator to model uncertain nonlinear functions that appear in virtual and act...
متن کاملFitting the Three-parameter Weibull Distribution by using Greedy Randomized Adaptive Search Procedure
The Weibull distribution is widely employed in several areas of engineering because it is an extremely flexible distribution with different shapes. Moreover, it can include characteristics of several other distributions. However, successful usage of Weibull distribution depends on estimation accuracy for three parameters of scale, shape and location. This issue shifts the attentions to the requ...
متن کامل